Accelerating PROPELLER-MRI by Means of Under-Sampling and Iterative Image Reconstruction using the Non-Uniform Fast Fourier Transform
نویسندگان
چکیده
Introduction: PROPELLER-MRI is a multi-shot fast spin-echo (FSE) data acquisition technique that is gaining popularity due to its reduced sensitivity to motion and B0 inhomogeneities. However, k-space sampling in PROPELLER is performed on a set of parallel lines forming a blade, which is rotated to cover k-space. This sampling pattern oversamples the central region of k-space, and PROPELLER acquisitions are at least 50% slower than conventional FSE. Often in MRI, imaging time is reduced by under-sampling k-space. In PROPELLER, the most significant reduction in acquisition time can be achieved by reducing the number of blades/acquisition while increasing the distance between lines. However, this violates the Nyquist criterion and leads to severe image artifacts when images are reconstructed with conventional gridding. Iterative reconstruction techniques are known to provide superior image quality when k-space is not sufficiently sampled. In this study, we investigated the trade-off between imaging time, artifacts and noise for under-sampled PROPELLER acquisitions with iterative reconstruction using the NUFFT operator. Methods: Simulations using different PROPELLER k-space sampling patterns were performed. The Shepp-Logan phantom was used in the simulations, since its k-space representation is known analytically. The field of view (FOV) in image space was 24cm x 24cm, and the image matrix was 256x256. The following k-space sampling patterns were tested: number of blades ={12, 11, 10, 9, 8, 7, 6}, and distance between lines in each blade = {1.00/FOV, 1.14/FOV, 1.26/FOV, 1.39/FOV, 1.57/FOV, 1.79/FOV, 2.00/FOV}, respectively. The number of lines per blade and samples per line were equal to 16 and 128 respectively. The pattern with 12 blades was fully sampled, and all other patterns were under-sampled. Zero mean Gaussian noise was added to the real and imaginary part of k-space to achieve SNR≅25 in the fully sampled case. All images were reconstructed using iterative reconstruction with NUFFT and a quadratic weighted least squares penalty. The penalty value was 0.1, and reconstruction was terminated after 50 iterations. All images were also reconstructed with conventional gridding. For every sampling pattern, the simulation was repeated 1000 times and the variance was measured on a voxel-by-voxel basis. To quantify the amount of artifacts, the ideal Shepp-Logan phantom image was subtracted from the mean image reconstructed for each sampling pattern, and the mean error per voxel was estimated by averaging the difference for all voxels. The mean error per voxel and mean variance were plotted as a function of the number of blades per sampling pattern. Human brain k-space data were also simulated for all PROPELLER sampling patterns, from a T2-weighted image of a normal human brain. Images were reconstructed using iterative reconstruction, as well as gridding. Results and Discussion: Figures 1a1, b1 show a fully sampled and a 50% under-sampled pattern with 12 and 6 blades, respectively. For the fully sampled case, both reconstruction methods produced similar, artifact-free, results for the Shepp-Logan phantom (Fig. 1a2, a3) and human brain (Fig. 1a4, a5). As the distance between lines increased to reduce the number of blades and increase the degree of under-sampling, images reconstructed with gridding exhibited severe artifacts caused by Nyquist holes (Fig. 1b2, b4). In contrast, images reconstructed with iterative reconstruction showed significantly reduced artifacts (Fig. 1b3, b5). However, reduction in the number of blades increased image noise. Figure 2 shows the relationship of noise and artifacts in images reconstructed iteratively using NUFFT, as a function of the number of blades in the sampling pattern. Also, Table 1 shows the percent increase in noise, and in mean error per voxel, as well as the percent decrease in imaging time with respect to full sampling, for various under-sampled patterns and iterative reconstruction using NUFFT. According to Figure 2 and Table 1, one can use an under-sampled PROPELLER k-space pattern and iterative reconstruction with NUFFT to obtain images with minimal image artifacts, unaffected spatial resolution in significantly reduced acquisition time (e.g. 8 blades, 33% reduction in acquisition time, only 1% increase in the mean error per voxel compared to the fully sampled case). The approach introduced in this work essentially minimizes the main disadvantage of PROPELLER-MRI, namely longer acquisition time, without altering image quality. Therefore, the technique presented here may soon become the main image reconstruction method for PROPELLER imaging.
منابع مشابه
Mean square optimal NUFFT approximation for efficient non-Cartesian MRI reconstruction.
The fast evaluation of the discrete Fourier transform of an image at non-uniform sampling locations is key to efficient iterative non-Cartesian MRI reconstruction algorithms. Current non-uniform fast Fourier transform (NUFFT) approximations rely on the interpolation of oversampled uniform Fourier samples. The main challenge is high memory demand due to oversampling, especially when multidimensi...
متن کاملIterative Reconstruction Methods for Non-cartesian Mri
For magnetic resonance imaging (MRI) with Cartesian k-space sampling, a simple inverse FFT usually suffices for image reconstruction. More sophisticated image reconstruction methods are needed for non-Cartesian k-space acquisitions. Regularized least-squares methods for image reconstruction involve minimizing a cost function consisting of a least-squares data fit term plus a regularizing roughn...
متن کاملAdvanced MRI reconstruction toolbox with accelerating on GPU
In this paper, we present a fast iterative magnetic resonance imaging (MRI) reconstruction algorithm taking advantage of the prevailing GPGPU programming paradigm. In clinical environment, MRI reconstruction is usually performed via fast Fourier transform (FFT). However, imaging artifacts (i.e. signal loss) resulting from susceptibility -induced magnetic field inhomogeneities degrade the qualit...
متن کاملImproving Non-Cartesian MRI Reconstruction through Discontinuity Subtraction
Non-Cartesian sampling is widely used for fast magnetic resonance imaging (MRI). Accurate and fast image reconstruction from non-Cartesian k-space data becomes a challenge and gains a lot of attention. Images provided by conventional direct reconstruction methods usually bear ringing, streaking, and other leakage artifacts caused by discontinuous structures. In this paper, we tackle these probl...
متن کاملFast, iterative, field-corrected image reconstruction for MRI
Magnetic field inhomogeneities cause distortions in the reconstructed images for non-cartesian k-space MRI (using spirals, for example). Several noniterative methods are currently used to compensate for the off-resonance during the reconstruction, but these methods rely on the assumption of a smoothly varying field map. Recently, iterative methods have been proposed that do not rely on this ass...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007